Tootfinder

Byzantine Reliable Broadcast with Low Communication and Time Complexity
Thomas Locher
https://arxiv.org/abs/2404.08070 https://arxiv.…

Byzantine Reliable Broadcast with Low Communication and Time Complexity
Byzantine reliable broadcast is a fundamental problem in distributed computing, which has been studied extensively over the past decades. State-of-the-art algorithms are predominantly based on the approach to share encoded fragments of the broadcast message, yielding an asymptotically optimal communication complexity when the message size exceeds the network size, a condition frequently encountered in practice. However, algorithms following the standard coding approach incur an overhead factor …